Sparse symmetric preconditioners for dense linear systems in electromagnetism

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse symmetric preconditioners for dense linear systems in electromagnetism

We consider symmetric preconditioning strategies for the iterative solution of dense complex symmetric non-Hermitian systems arising in computational electromagnetics. In particular we report on the numerical behaviour of the classical Incomplete Cholesky factorization as well as some of its recent variants and consider also well known factorized approximate inverses. We illustrate the difficul...

متن کامل

Block preconditioners for symmetric indefinite linear systems

This paper presents a systematic theoretical and numerical evaluation of three common block preconditioners in a Krylov subspace method for solving symmetric indefinite linear systems. The focus is on large-scale real world problems where block approximations are a practical necessity. The main illustration is the performance of the block diagonal, constrained, and lower triangular precondition...

متن کامل

Wavelet based preconditioners for sparse linear systems

A class of efficient preconditioners based on Daubechies family of wavelets for sparse, unsymmetric linear systems that arise in numerical solution of Partial Differential Equations (PDEs) in a wide variety of scientific and engineering disciplines are introduced. Complete and Incomplete Discrete Wavelet Transforms in conjunction with row and column permutations are used in the construction of ...

متن کامل

Block Approximate Inverse Preconditioners for Sparse Nonsymmetric Linear Systems

Abstract. In this paper block approximate inverse preconditioners to solve sparse nonsymmetric linear systems with iterative Krylov subspace methods are studied. The computation of the preconditioners involves consecutive updates of variable rank of an initial and nonsingular matrix A0 and the application of the Sherman-MorrisonWoodbury formula to compute an approximate inverse decomposition of...

متن کامل

Rational Approximation Preconditioners for General Sparse Linear Systems

This paper presents a class of preconditioning techniques which exploit rational function approximations to the original matrix. The matrix is rst shifted and then an incomplete LU factorization of the resulting matrix is computed. The resulting factors are then used to compute a better preconditioner to the original matrix. Since the incomplete factorization is made on a shifted matrix, a good...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Numerical Linear Algebra with Applications

سال: 2004

ISSN: 1070-5325,1099-1506

DOI: 10.1002/nla.345